/**
 * 
 */
package array;

import java.util.Arrays;

import utils.CreateUtils;
import utils.PrintUtils;

/**
 * @author Michael
 * Given an input array of integers of size n, and a query array of 
 * integers, find the smallest window of input array that 
 * contains all the elements of query array and also in the same order
 */
public class FindSmallestWindowForQueryArray {

	//n ^ 2
	public static boolean findWindow(int[] arr, int[] query) {
		return false;
	}

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		int[] arr = CreateUtils.randNonNegIntArray(20, 10);
		int[] query = CreateUtils.randNonNegIntArray(5, 10);
		PrintUtils.printArray(arr);
		PrintUtils.printArray(query);
		findWindow(arr, query);
	}

	/**
	 * 
	 */
	public FindSmallestWindowForQueryArray() {
		// TODO Auto-generated constructor stub
	}
}
